Subgraph isomorphism problem
THE NP-COMPLETE PROBLEM OF TESTING WHETHER ONE GRAPH IS A SUBGRAPH OF ANOTHER
Subgraph matching; Subgraph isomorphism; Substructure search; Algorithms for solving subgraph isomorphism problems; Methods for solving subgraph isomorphism problems
In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H.